Robust transmission of unbounded strings using Fibonacci representations

Families of Fibonacci codes and Fibonacci representations are defined. Their main attributes are: (i) robustness, manifesting itself by the local containment of errors; (ii) simple encoding and and decoding. The main applica· tiOD explored is the transmission of binary strings whose length is in aD. unknown range, using robust Fibonacci representations instead of the conventional errorsensitive logarithmic ramp representation. Though the former is asymptotically longer than the latter, the former is actually shorter for very large initial segments of integers.